A coincidence theorem involving contractible spaces
نویسندگان
چکیده
منابع مشابه
Random Coincidence Point Theorem in Fréchet Spaces with Applications
We proved a random coincidence point theorem for a pair of commuting random operators in the setup of Fréchet spaces. As applications, we obtained random fixed point and best approximation results for ∗-nonexpansive multivalued maps. Our results are generalizations or stochastic versions of the corresponding results of Shahzad and Latif [Shahzad, N.; Latif, A. A random coincidence point theorem...
متن کاملCaristi Type Coincidence Point Theorem in Topological Spaces
The paper is concerned with a very general version of Caristi’s coincidence theorem, in topological spaces (X, τ) satisfying some completeness conditions with respect to a function p : X ×X → [0,∞), and having as consequence Caristi’s fixed point theorem. The general result is applied to various concrete situations quasi-metric spaces, bornological spaces to obtain versions of Ekeland’s variati...
متن کاملCoincidence point theorem in ordered fuzzy metric spaces and its application in integral inclusions
The purpose of this paper is to present some coincidence point and common fixed point theorems for multivalued contraction maps in complete fuzzy metric spaces endowed with a partial order. As an application, we give an existence theorem of solution for general classes of integral inclusions by the coincidence point theorem.
متن کاملA Lefschetz-type Coincidence Theorem
A Lefschetz-type coincidence theorem for two maps f, g : X → Y from an arbitrary topological space to a manifold is given: Ifg = λfg, that is, the coincidence index is equal to the Lefschetz number. It follows that if λfg 6= 0 then there is an x ∈ X such that f(x) = g(x). In particular, the theorem contains well-known coincidence results for (i) X,Y manifolds, f boundary-preserving, and (ii) Y ...
متن کاملThe Interprocedural Coincidence Theorem
We present an interprocedural generalization of the well-known (intraprocedural) Coincidence Theorem of Kam and Ullman, which provides a suucient condition for the equivalence of the meet over all paths (MOP) solution and the maximal xed point (MFP) solution to a data ow analysis problem. This generalization covers arbitrary imperative programs with recursive procedures, global and local variab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 1997
ISSN: 0893-9659
DOI: 10.1016/s0893-9659(97)00034-7